A Bijection Between Partially Directed Paths in the Symmetric Wedge and Matchings
نویسنده
چکیده
We give a bijection between partially directed paths in the symmetric wedge y = ±x and matchings, which sends north steps to nestings. This gives a bijective proof of a result of Prellberg et al. that was first discovered through the corresponding generating functions: the number of partially directed paths starting at the origin confined to the symmetric wedge y = ±x with k north steps is equal to the number of matchings on [2n] with k nestings.
منابع مشابه
Nestings of Matchings and Permutations and North Steps in Pdsaws
We present a simple bijective proof of the fact that matchings of [2n] with N nestings are equinumerous to partially directed self avoiding walks confined to the symmetric wedge defined by y = ±x, with n east steps and N north steps. A very similar construction connects permutations with N nestings and PDSAWs remaining below the x-axis, again with N north steps. Furthermore, both bijections tra...
متن کاملMatchings Avoiding Partial Patterns and Lattice Paths
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (0, 2) to (2n, 0). As a consequence, the refined enumeration of 1123-avoiding matchings can be reduced to the enumeration of certain lattice paths. Another result of this paper is a bijection between 1132-avoiding match...
متن کاملPartially directed paths in a symmetric wedge
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating function, and its solution. In this paper we consider a model of partially directed walks from the origin in the square lattice confined to a symmetric wedge...
متن کاملReduced Decompositions of Matchings
We give a characterization of matchings in terms of the canonical reduced decompositions. As an application, the canonical reduced decompositions of 12312avoiding matchings are obtained. Based on such decompositions, we find a bijection between 12312-avoiding matchings and ternary paths.
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008